Merging a set of polygons with non-stable borders
نویسنده
چکیده
The paper introduces an algorithm dealing with polygons with non-stable borders. Such polygons may appear because of measuring errors or during scanning and vectorisation of blueprints. The aim of the algorithm is to remove these errors within prescribed tolerance. The algorithm uses a sweepline approach and works in two steps. In the first step, all non-stable areas are determined and in the second step fixed.
منابع مشابه
Map-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots
In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...
متن کاملA Fast Algorithm for Covering Rectangular Orthogonal Polygons with a Minimum Number of r-Stars
Introduction This paper presents an algorithm for covering orthogonal polygons with minimal number of guards. This idea examines the minimum number of guards for orthogonal simple polygons (without holes) for all scenarios and can also find a rectangular area for each guards. We consider the problem of covering orthogonal polygons with a minimum number of r-stars. In each orthogonal polygon P,...
متن کاملCONTROL OF CHAOS IN A DRIVEN NON LINEAR DYNAMICAL SYSTEM
We present a numerical study of a one-dimensional version of the Burridge-Knopoff model [16] of N-site chain of spring-blocks with stick-slip dynamics. Our numerical analysis and computer simulations lead to a set of different results corresponding to different boundary conditions. It is shown that we can convert a chaotic behaviour system to a highly ordered and periodic behaviour by making on...
متن کاملA New Merging Process for Data Integration Based on the Discrete Fréchet Distance
The overlay process is currently one of the main computational solutions used to integrate several data layers from different sources. Unfortunately, it is problematic when trying to overlay many layers. This leads to several geometric problems such as the management of sliver polygons. This paper proposes a new merging process to complement the vector overlay for data integration of several la...
متن کاملSolving Geometric Problems with the Rotating Calipers *
Shamos [1] recently showed that the diameter of a convex n-sided polygon could be computed in O(n) time using a very elegant and simple procedure which resembles rotating a set of calipers around the polygon once. In this paper we show that this simple idea can be generalized in two ways: several sets of calipers can be used simultaneously on one convex polygon, or one set of calipers can be us...
متن کامل